Solving Geometrical Place Problems by using Evolutionary Algorithms
نویسنده
چکیده
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially random generated) is evolved using genetic operators. Population obtained after a specified number of iterations will contain solutions which (very likely) accomplish the geometrical place problem conditions. Geometrical place usually consists in more than one solution. By applying evolutionary algorithms to geometrical place problems multiple solutions can be obtained in a single run.
منابع مشابه
Search Optimization Using Hybrid Particle Sub- Swarms and Evolutionary Algorithms
Particle Swarm Optimization (PSO) technique proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have been proposed. This paper proposes a variant of the PSO technique named Independent Neighborhoods Particle Swarm Optimization (INPSO) dealing with sub-swarms for solving the well known geometrical place problems. Finding t...
متن کاملHybrid Particle Swarm - Evolutionary Algorithm for Search and Optimization
Particle Swarm Optimization (PSO) technique has proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have been proposed. This paper proposes a novel hybrid PSO evolutionary algorithm for solving the well known geometrical place problems. Finding the geometrical place could be sometimes a hard task. In almost all situations...
متن کاملSolving random inverse heat conduction problems using PSO and genetic algorithms
The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...
متن کاملSolving Multi-objective Optimal Control Problems of chemical processes using Hybrid Evolutionary Algorithm
Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. This paper applies an evolutionary optimization scheme, inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...
متن کاملA Hybrid MOEA/D-TS for Solving Multi-Objective Problems
In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...
متن کامل